Quality:

Weak NP-completeness - set of computational problems for which there is an algorithm solving them in polynomial time in the dimension of the problem and the magnitudes of the data involved (if given as integers), rather than the base-two logarithms of their magnitudes. Article “Weak NP-completeness” in English Wikipedia has 14.7 points for quality (as of July 1, 2025).
The article contains 3 references and 1 sections.
Since the creation of article “Weak NP-completeness”, its content was written by 18 registered users of English Wikipedia and edited by 18 registered Wikipedia users in all languages.
The article is cited 11 times in English Wikipedia and cited 11 times in all languages.
The highest Authors Interest rank from 2001:
- Local (English): #218712 in January 2007
- Global: #439114 in January 2007
The highest popularity rank from 2008:
- Local (English): #865862 in January 2024
- Global: #1464308 in January 2024
There is 1 language version for this article in the WikiRank database (of the considered 55 Wikipedia language editions).
The quality and popularity assessment was based on Wikipédia dumps from July 1, 2025 (including revision history and pageviews for previous years).